Scheduling Jobs with Multiple Feasible Intervals
نویسندگان
چکیده
This paper addresses the problem of scheduling real-time jobs that have multiple feasible intervals. The problem is NP-hard. We present an optimal branch-and-bound algorithm. When there is time to compute the schedule, this algorithm can be used. Otherwise, the simple heuristics presented here can be used. In addition, a priority-boosting EDF algorithm is designed to enhance the timeliness of jobs. Simulation results show that the combined use of the heuristics and the priority boosting EDF algorithm performs nearly as well as the optimal algorithm.
منابع مشابه
Energy optimal schedules for jobs with multiple active intervals
In this paper, we study the scheduling problem of jobs with multiple active intervals. Each job in the problem instance has n (n > 1) disjoint active time intervals where it can be executed and a workload characterized by the required number of CPU cycles. Previously, people studied multiple interval job scheduling problem where each job must be assigned enoughCPU cycles in one of its active in...
متن کاملNo-idle time Scheduling of Open shops: Modeling and Meta-heuristic Solution Methods
In some industries as foundries, it is not technically feasible to interrupt a processor between jobs. This restriction gives rise to a scheduling problem called no-idle scheduling. This paper deals with scheduling of no-idle open shops to minimize maximum completion time of jobs, called makespan. The problem is first mathematically formulated by three different mixed integer linear programming...
متن کاملPower-aware Online Dynamic Scheduling for Multiple Feasible Intervals
Multiple Feasible Intervals (MFI) is a task model which has more than one interval for each task instance to run. In our previous work, different scheduling algorithms are proposed for both static MFI dynamic MFI during run-time. Real-life situations demand dynamic MFI, but calculating an MFI schedule is a NP-Hard problem and efficiency of algorithm itself is one of the main concerns. In this p...
متن کاملImproved approximation algorithms for scheduling with fixed jobs
We study two closely related problems in non-preemptive scheduling of sequential jobs on identical parallel machines. In these two settings there are either fixed jobs or nonavailability intervals during which the machines are not available; in either case, the objective is to minimize the makespan. Both formulations have different applications, e.g. in turnaround scheduling or overlay computin...
متن کاملThe Problem of Scheduling Multiple Groups of Jobs on Multiple Processors at Different Speeds
We mainly study the Cmax problem of scheduling n groups of jobs on n special-purpose processors and m general-purpose processors at different speeds provided that the setup time of each job is less than α times of its processing time. We first propose an improved LS algorithm. Then, by applying this new algorithm, we obtain two bounds for the ratio of the approximate solution TLS to the optimal...
متن کامل